Non total-unimodularity neutralized simplicial complexes
نویسندگان
چکیده
منابع مشابه
Non Total-Unimodularity Neutralized Simplicial Complexes
Given a simplicial complex K with weights on its simplices and a chain on it, the Optimal Homologous Chain Problem (OHCP) is to find a chain with minimal weight that is homologous (over Z) to the given chain. The OHCP is NP-complete, but if the boundary matrix of K is totally unimodular (TU), it becomes solvable in polynomial time when modeled as a linear program (LP). We define a condition on ...
متن کاملGeneralisations of total unimodularity
In this paper we examine possible generalisations of total unimodularity. To this end, we introduce two concepts: total k-modularity and k-regularity. Total k-modularity extends the permitted values for the subdeterminants of a matrix to the powers of k, while k-regularity sets requirements on the inverses of non-singular submatrices. It is shown that the advantageous properties of totally unim...
متن کاملTotal Dual Integrality 1.1 Total Unimodularity
where A and b are rational and the associate dual program min y b s.t. A y = c (2) y ≥ 0 Definition 1 The system of inequalities by Ax ≤ b is Total Dual Integral or TDI if for all integral vectors c the dual program has an integral solution whenever the optimal value is finite. The main result for today is Theorem 1 If Ax ≤ b is TDI and b is integral then P = {x : Ax ≤ b} is integral ∗ ∗ Proof:...
متن کاملNew methods for constructing shellable simplicial complexes
A clutter $mathcal{C}$ with vertex set $[n]$ is an antichain of subsets of $[n]$, called circuits, covering all vertices. The clutter is $d$-uniform if all of its circuits have the same cardinality $d$. If $mathbb{K}$ is a field, then there is a one-to-one correspondence between clutters on $V$ and square-free monomial ideals in $mathbb{K}[x_1,ldots,x_n]$ as follows: To each clutter $mathcal{C}...
متن کاملLecture 4 — Total Unimodularity and Total Dual Integrality
Definition 1.1. A matrix A ∈ Zm×n is totally unimodular if the determinant of every square submatrix B ∈ Zk×k equals either −1, 0, or +1. Alternatively, by Cramer’s rule, A ∈ Zm×n is totally unimodular if every nonsingular submatrix B ∈ Zk×k has an integral inverse B−1 ∈ Zk×k. Recall: B−1 = 1 det B B ∗, where B∗ is the adjugate matrix (transpose of the matrix of cofactors) of B. One important c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2018
ISSN: 0166-218X
DOI: 10.1016/j.dam.2016.01.004